Primary and biprimary class sizes implying nilpotency of finite groups
نویسندگان
چکیده
منابع مشابه
nth-roots and n-centrality of finite 2-generator p-groups of nilpotency class 2
Here we consider all finite non-abelian 2-generator $p$-groups ($p$ an odd prime) of nilpotency class two and study the probability of having $n^{th}$-roots of them. Also we find integers $n$ for which, these groups are $n$-central.
متن کاملOn the nilpotency class of the automorphism group of some finite p-groups
Let $G$ be a $p$-group of order $p^n$ and $Phi$=$Phi(G)$ be the Frattini subgroup of $G$. It is shown that the nilpotency class of $Autf(G)$, the group of all automorphisms of $G$ centralizing $G/ Fr(G)$, takes the maximum value $n-2$ if and only if $G$ is of maximal class. We also determine the nilpotency class of $Autf(G)$ when $G$ is a finite abelian $p$-group.
متن کاملPrimary subgroups and p-nilpotency of finite groups
In this paper, we investigate the influence of Ssemipermutable and weakly S-supplemented subgroups on the pnilpotency of finite groups. Some recent results are generalized. Keywords—S-semipermutable, weakly S-supplemented, pnilpotent.
متن کاملTHE NILPOTENCY CLASS OF FINITE GROUPS OF EXPONENT p
We investigate the properties of Lie algebras of characteristic p which satisfy the Engel identity xy" = 0 for some n < p. We establish a criterion which (when satisfied) implies that if a and b are elements of an Engel-n Lie algebra L then abn~2 generates a nilpotent ideal of I. We show that this criterion is satisfied for n = 6, p = 1, and we deduce that if G is a finite m-generator group of ...
متن کاملBilinear cryptography using finite p-groups of nilpotency class 2
The origin of pairing based cryptosystems is in the MOV attack [10] on the elliptic curve discrete logarithm problem. The attack was first envisioned by Gerhard Frey. The idea was to use the bilinear properties of the Weil pairing to reduce a discrete logarithm problem in an elliptic curve over a finite field Fq to a discrete logarithm problem in Fqk . It is known [1] that most of the time for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TURKISH JOURNAL OF MATHEMATICS
سال: 2016
ISSN: 1300-0098,1303-6149
DOI: 10.3906/mat-1504-79